منابع مشابه
Minimal stable sets in tournaments
We propose a systematic methodology for defining tournament solutions as extensions of maximality. The central concepts of this methodology are maximal qualified subsets and minimal stable sets. We thus obtain an infinite hierarchy of tournament solutions, encompassing the top cycle, the uncovered set, the Banks set, the minimal covering set, and the tournament equilibrium set. Moreover, the hi...
متن کاملMinimal extending sets in tournaments
In 2011, Brandt proposed a new tournament solution called the minimal extending set (ME). It was conjectured that ME satisfies a large number of desirable properties. In this paper, we non-constructively show that ME fails to satisfy most of these properties. However, no concrete examples of these violations are known and it appears that ME satisfies these properties for all practical purposes....
متن کاملMinimal retentive sets in tournaments
Many problems in multiagent decision making can be addressed using tournament solutions, i.e., functions that associate with each complete and asymmetric relation on a set of alternatives a non-empty subset of the alternatives. For a given tournament solution S, Schwartz calls a set of alternatives S-retentive if it satisfies a natural stability criterion with respect to S. He then recursively ...
متن کاملStable Sets of Weak Tournaments
1. Introduction :-An abiding problem in choice theory has been one of characterizing those choice functions which are obtained as a result of some kind of optimisation. Specifically, the endeavour has concentrated largely on finding a binary relation (if there be any) whose best elements coincide with observed choices. An adequate survey of this line of research till the mid eighties is availab...
متن کاملImproved Bounds for Minimal Feedback Vertex Sets in Tournaments
We study feedback vertex sets (FVS) in tournaments, which are orientations of complete graphs. As our main result, we show that any tournament on n nodes has at most 1.5949 minimal FVS. This significantly improves the previously best upper bound of 1.6667 by Fomin et al. (STOC 2016). Our new upper bound almost matches the best known lower bound of 21n/7 ≈ 1.5448, due to Gaspers and Mnich (ESA 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Economic Theory
سال: 2011
ISSN: 0022-0531
DOI: 10.1016/j.jet.2011.05.004